Sensitivity Analysis for Stationary and Ergodic Queues

نویسندگان

  • P. Konstantopoulos
  • M. Zazanis
چکیده

Starting with some mild assumptions on the parametrization of the service process, perturbation analysis (PA) estimates are obtained for stationary and ergodic single server queues. Besides relaxing the stochastic assumptions, our approach solves some problems associated with the traditional regenerative approach taken in most of the previous work in this area. First, it avoids problems caused by perturbations interfering with the regenerative structure of the system. Second, given that the major interest is in steady-state performance measures, it examines directly the stationary version of the system, instead of considering performance measures expressed as Cesaro limits. Finally, it provides new estimators for general (possibly discontinuous) functions of the workload and other steady-state quantities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of Retrial Queues with Versatile Retrial Policy

We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. F...

متن کامل

On infinite queueing tandems*

We study the flow of jobs on an infinite series of first-come-first-served queues. Jobs are placed in the buffer of the first queue and allowed to flow through the infinite tandem of queues. The service times of each job on consecutive queues form a stationary and ergodic sequence. We are interested in characterizing the flow of jobs asymptotically, after they have passed through a large number...

متن کامل

On the stability of the multi-queue multi-server processor sharing with limited service

We consider a multi-queue multi-server system with n servers (processors) and m queues. At the system there arrives a stationary and er-godic stream of m different types of requests with service requirements which are served according to the following k-limited head of the line processor sharing discipline: The first k requests at the head of the m queues are served in processor sharing by the ...

متن کامل

An Approximation for Performance Evaluation of Stationary Single Server Queues

This paper provides a method for approzimating the probability distributions of stationary statistics in FIFO single server queues. The method is based on the Wiener Hopf factorization technique, and is applied to semi-Markov queues where the underlying state space is of unlimited size. A particularly important case is a model for a statistical multiplezer where the net input process forms a st...

متن کامل

The attractiveness of the fixed points of a ·/GI/1 queue

We consider an infinite tandem of first-come-first-served queues. The service times have unit mean, and are independent and identically distributed across queues and customers. Let I be a stationary and ergodic interarrival sequence with marginals of mean τ > 1, and suppose it is independent of all service times. The process I is said to be a fixed point for the first, and hence for each, queue...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005